A Bijection for Partitions with All Ranks at Least t
نویسندگان
چکیده
منابع مشابه
A Bijection for Partitions with All Ranks at Least t
It follows from work of Andrews and Bressoud that for t the number of parti tions of n with all successive ranks at least t is equal to the number of partitions of n with no part of size t We give a simple bijection for this identity which generalizes a result of Cheema and Gordon for rowed plane partitions The bijection yields several re nements of the identity when the partition counts are pa...
متن کاملA Bijection for Partitions with All Ranks at Least tSylvie
It follows from work of Andrews and Bressoud that for t 1, the number of partitions of n with all successive ranks at least t is equal to the number of partitions of n with no part of size 2?t. We give a simple bijection for this identity which generalizes a result of Cheema and Gordon for 2-rowed plane partitions. The bijection yields several reenements of the identity when the partition count...
متن کاملA Bijection for Partitions with All Ranks at Least t Extended
It follows from work of Andrews and Bressoud that for t the number of partitions of n with all successive ranks at least t is equal to the number of partitions of n with no part of size t However no simple combinatorial explanation of this fact has appeared in the literature We give a simple bijection for this identity which generalizes a result of Cheema and Gordon for rowed plane partitions T...
متن کاملA Bijection between Shuffles and Set Partitions
Recall from Garsia’s paper that Ba is the group algebra Q(Sn) element Ba = 1 2 3 · · · a Wa,n = ∑ α∈Sa α Wa,n, where Wa,n is the word Wa,n = (a+ 1)(a+ 2) · · ·n. The motivation is that we have a deck of cards labelled 1, 2, . . . , n, and Ba represents all possible decks that may result from removing the cards 1, 2, . . . , a and then inserting them back into the deck (consisting of the cards a...
متن کاملA Bijection between Atomic Partitions and Unsplitable Partitions
In the study of the algebra NCSym of symmetric functions in noncommutative variables, Bergeron and Zabrocki found a free generating set consisting of power sum symmetric functions indexed by atomic partitions. On the other hand, Bergeron, Reutenauer, Rosas, and Zabrocki studied another free generating set of NCSym consisting of monomial symmetric functions indexed by unsplitable partitions. Can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1998
ISSN: 0097-3165
DOI: 10.1006/jcta.1998.2873